The fashion industry is one of the most active and competitive markets in the world, manufacturing millions of products and reaching large audiences every year. A plethora of business processes are involved in this large-scale industry, but due to the generally short life-cycle of clothing items, supply-chain management and retailing strategies are crucial for good market performance. Correctly understanding the wants and needs of clients, managing logistic issues and marketing the correct products are high-level problems with a lot of uncertainty associated to them given the number of influencing factors, but most importantly due to the unpredictability often associated with the future. It is therefore straightforward that forecasting methods, which generate predictions of the future, are indispensable in order to ameliorate all the various business processes that deal with the true purpose and meaning of fashion: having a lot of people wear a particular product or style, rendering these items, people and consequently brands fashionable. In this paper, we provide an overview of three concrete forecasting tasks that any fashion company can apply in order to improve their industrial and market impact. We underline advances and issues in all three tasks and argue about their importance and the impact they can have at an industrial level. Finally, we highlight issues and directions of future work, reflecting on how learning-based forecasting methods can further aid the fashion industry.

这项工作在拆分计算领域迈出了重大步骤，即如何拆分深神经网络以将其早期部分托管在嵌入式设备上，而其余则在服务器上。到目前为止，已经确定了潜在的分裂位置，以利用独特的建筑方面，即基于层尺寸。在此范式下，只有在执行分裂并重新训练整个管道后，才能评估分裂的疗效，从而对所有合理的分裂点在时间方面进行详尽的评估。在这里，我们表明，不仅层的结构确实很重要，而且其中包含的神经元的重要性也很重要。如果神经元相对于正确的班级决策，神经元很重要。因此，应在具有高密度的重要神经元的层后立即施加拆分，以保留流动的信息。根据这个想法，我们提出了可解释的拆分（i-split）：通过提供有关该分型在分类准确性方面的表现，事先对其有效实现的可靠性，以确定最合适的分裂点的过程。作为I-Split的另一个重大贡献，我们表明，多类分类问题的分裂点的最佳选择还取决于网络必须处理的特定类别。详尽的实验已在两个网络（VGG16和Resnet-50）以及三个数据集（Tiny-Imagenet-200，Notmnist和胸部X射线肺炎）上进行。源代码可在https://github.com/vips4/i-split上获得。

传统的自动门不能区分希望穿过门和经过门的人们，因此他们经常不必要地打开。这导致需要在商业和非商业环境中采用新系统：智能门。特别是，智能门系统根据周围环境的社会环境预测了门附近的人们的意图，然后就是否打开门做出合理的决定。这项工作提出了与智能门有关的第一张纸张，没有铃铛和哨子。我们首先指出，问题不仅涉及可靠性，气候控制，安全性和操作方式。的确，通过对近亲学和场景推理的复杂结合分析，一种预测门附近人们意图的系统还涉及对场景的社会背景的更深入了解。此外，我们对自动门进行了详尽的文献综述，提供了一种新型的系统配方。此外，我们对智能门的未来应用，道德缺陷的描述和立法问题进行了分析。

我们提出了一个以数据为中心的管道，能够为新的时尚产品性能预测（NFPPF）问题生成外源性观察数据，即预测没有过去观察的全新服装探测的性能。我们的管道从一件服装探针的单个可用图像开始制造了失踪的过去。它首先要扩展与图像关联的文本标签，在过去的特定时间上查询相关的时尚图像或不合时宜的图像。通过自信的学习，可以在这些网络图像上对二进制分类器进行良好的训练，以了解过去的时尚以及探测图像对这种时尚性的概念的符合。这种合规性产生了潜在的性能（POP）时间序列，表明如果探针的性能较早，则该探针的性能如何。 POP被证明是对探针未来表现的高度预测，可以改善最近Visuelle快速时尚数据集中所有最先进模型的销售预测。我们还表明，流行音乐反映了时尚前锋基准上的新样式（服装合奏）的基础真实性的普及，这表明我们的熟悉的信号是一个真实的流行，每个人都可以访问，并且可以在任何分析时间范围内获得普遍性。 。预测代码，数据和流行时间序列可在以下网址获得：https：//github.com/humaticslab/pop-mining-potential-performance

本文介绍了一场组织的结果，以评估3D手姿势序列中异质手势的在线识别方法的方法。任务是检测属于以不同姿势和运动特征为特征的16个类词典的手势。该数据集具有手跟踪数据的连续序列，其中手势与不显着的动作交织在一起。在现实的混合现实交互用例中，使用HoloLens 2手指跟踪系统捕获了数据。评估不仅基于检测性能，还基于延迟和误报，使您可以根据提出的算法了解实际交互工具的可行性。比赛评估的结果表明需要进一步研究以减少识别错误，而所提出的算法的计算成本足够低。

We present Visuelle 2.0, the first dataset useful for facing diverse prediction problems that a fast-fashion company has to manage routinely. Furthermore, we demonstrate how the use of computer vision is substantial in this scenario. Visuelle 2.0 contains data for 6 seasons / 5355 clothing products of Nuna Lie, a famous Italian company with hundreds of shops located in different areas within the country. In particular, we focus on a specific prediction problem, namely short-observation new product sale forecasting (SO-fore). SO-fore assumes that the season has started and a set of new products is on the shelves of the different stores. The goal is to forecast the sales for a particular horizon, given a short, available past (few weeks), since no earlier statistics are available. To be successful, SO-fore approaches should capture this short past and exploit other modalities or exogenous data. To these aims, Visuelle 2.0 is equipped with disaggregated data at the item-shop level and multi-modal information for each clothing item, allowing computer vision approaches to come into play. The main message that we deliver is that the use of image data with deep networks boosts performances obtained when using the time series in long-term forecasting scenarios, ameliorating the WAPE and MAE by up to 5.48% and 7% respectively compared to competitive baseline methods. The dataset is available at https://humaticslab.github.io/forecasting/visuelle

新的时尚产品销售预测是一个具有挑战性的问题，涉及许多业务动态，无法通过经典的预测方法来解决。在本文中，我们研究了以Google趋势时间序列的形式进行系统探索外源知识的有效性，并将其与与全新时尚项目相关的多模式信息结合在一起，以便有效地预测其销售额，尽管缺乏过去数据。特别是，我们提出了一种基于神经网络的方法，编码器在其中学习了外源时间序列的表示，而解码器则根据Google趋势编码以及可用的视觉和元数据信息来预测销售。我们的模型以非自动回归方式起作用，避免了大型第一步错误的复合效果。作为第二个贡献，我们介绍了Visuelle，这是一个公开可用的数据集，用于新时尚产品销售预测的任务，其中包含5577 Real，新产品的多模式信息，该产品在2016 - 2019年之间从意大利快速时尚公司Nunalie出售。该数据集配备了产品，元数据，相关销售以及相关的Google趋势的图像。我们使用Visuelle将我们的方法与最新的替代方案和几种基线进行比较，这表明我们基于神经网络的方法在百分比和绝对错误方面都是最准确的。值得注意的是，外源知识的添加使预测准确性提高了1.5％的Wape，从而揭示了利用内容丰富的外部信息的重要性。代码和数据集均可在https://github.com/humaticslab/gtm-transformer上获得。

在本文中，我们专注于在线学习主动视觉在未知室内环境中的对象的搜索（AVS）的最优策略问题。我们建议POMP++，规划战略，介绍了经典的部分可观察蒙特卡洛规划（POMCP）框架之上的新制剂，允许免费培训，在线政策在未知的环境中学习。我们提出了一个新的信仰振兴战略，允许使用POMCP与动态扩展状态空间来解决在线生成平面地图的。我们评估我们在两个公共标准数据集的方法，AVD由是从真正的3D场景渲染扫描真正的机器人平台和人居ObjectNav收购，用>10％，比国家的the-改善达到最佳的成功率技术方法。

Computational units in artificial neural networks follow a simplified model of biological neurons. In the biological model, the output signal of a neuron runs down the axon, splits following the many branches at its end, and passes identically to all the downward neurons of the network. Each of the downward neurons will use their copy of this signal as one of many inputs dendrites, integrate them all and fire an output, if above some threshold. In the artificial neural network, this translates to the fact that the nonlinear filtering of the signal is performed in the upward neuron, meaning that in practice the same activation is shared between all the downward neurons that use that signal as their input. Dendrites thus play a passive role. We propose a slightly more complex model for the biological neuron, where dendrites play an active role: the activation in the output of the upward neuron becomes optional, and instead the signals going through each dendrite undergo independent nonlinear filterings, before the linear combination. We implement this new model into a ReLU computational unit and discuss its biological plausibility. We compare this new computational unit with the standard one and describe it from a geometrical point of view. We provide a Keras implementation of this unit into fully connected and convolutional layers and estimate their FLOPs and weights change. We then use these layers in ResNet architectures on CIFAR-10, CIFAR-100, Imagenette, and Imagewoof, obtaining performance improvements over standard ResNets up to 1.73%. Finally, we prove a universal representation theorem for continuous functions on compact sets and show that this new unit has more representational power than its standard counterpart.

The open-radio access network (O-RAN) embraces cloudification and network function virtualization for base-band function processing by dis-aggregated radio units (RUs), distributed units (DUs), and centralized units (CUs). These enable the cloud-RAN vision in full, where multiple mobile network operators (MNOs) can install their proprietary or open RUs, but lease on-demand computational resources for DU-CU functions from commonly available open-clouds via open x-haul interfaces. In this paper, we propose and compare the performances of min-max fairness and Vickrey-Clarke-Groves (VCG) auction-based x-haul and DU-CU resource allocation mechanisms to create a multi-tenant O-RAN ecosystem that is sustainable for small, medium, and large MNOs. The min-max fair approach minimizes the maximum OPEX of RUs through cost-sharing proportional to their demands, whereas the VCG auction-based approach minimizes the total OPEX for all resources utilized while extracting truthful demands from RUs. We consider time-wavelength division multiplexed (TWDM) passive optical network (PON)-based x-haul interfaces where PON virtualization technique is used to flexibly provide optical connections among RUs and edge-clouds at macro-cell RU locations as well as open-clouds at the central office locations. Moreover, we design efficient heuristics that yield significantly better economic efficiency and network resource utilization than conventional greedy resource allocation algorithms and reinforcement learning-based algorithms.